Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations
نویسنده
چکیده
We develop a framework on multi-head nite automata that allows us to study the relation of parallel logarithmic time and sequential logarithmic space in a uniform and nonuniform setting in more detail. In both settings it turns out that NC 1 requires data-independent computations|the movement of the input-heads only depends on the length of the input|whereas logarithmic space is caught with data-dependent computations on multi-head nite state machines. This shed new light on the question whether these two classes coincide or not.
منابع مشابه
A Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata
In this paper we deal with one-way multi-head data-independent finite automata. A k-head finite automaton A is data-independent, if the position of every head i after step t in the computation on an input w is a function that depends only on the length of the input w, on i and on t (i.e. the trajectories of heads must be the same on the inputs of the same length). It is known that k(k + 1)/2 + ...
متن کاملOn the power of parallel communicating Watson-Crick automata systems
Parallel communicating Watson-Crick automata systems were introduced in [2] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [5], that for Watson-Crick finite automata, the complementarity relation plays no active r...
متن کاملIdentification of DFA: data-dependent versus data-independent algorithms
Algorithms that infer deterministic finite automata from given data and that comply with the identification in the limit condition have been thoroughly tested and are in practice often preferred to elaborate heuristics. Even if there is no guarantee of identification from the available data, the existence of associated characteristic sets means that these algorithms converge towards the correct...
متن کاملMulti-head Watson-Crick automata
Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce a new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of ...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997